An Efficient Double Complementation Algorithm for Superposition-Based Finite-State Morphology
نویسنده
چکیده
This paper presents an efficient compilation algorithm that is several orders of magnitude faster than a standard method for context restriction rules. The new algorithm combines even hundreds of thousands of rules in parallel when the alphabet is large but the resulting automaton is sparse. The method opens new possibilities for representation of contextdependent lexical entries and the related processes. This is demonstrated by encoding complete HunSpell dictionaries as a single context restriction rule whose center placeholder in contexts is replaced with a new operation, called underline operation. The approach gives rise to new superposition-based contextdependent lexicon formalisms and new methods for on-demand compilation and composition of two-level morphology.
منابع مشابه
Structural Reliability: An Assessment Using a New and Efficient Two-Phase Method Based on Artificial Neural Network and a Harmony Search Algorithm
In this research, a two-phase algorithm based on the artificial neural network (ANN) and a harmony search (HS) algorithm has been developed with the aim of assessing the reliability of structures with implicit limit state functions. The proposed method involves the generation of datasets to be used specifically for training by Finite Element analysis, to establish an ANN model using a proven AN...
متن کاملAn efficient finite difference time domain algorithm for band structure calculations of Phononic crystal
In this paper, a new algorithm for studying elastic wave propagation in the phononic crystals is presented. At first, the displacement-based forms of elastic wave equations are derived and then the forms are discretized using finite difference method. So the new algorithm is called the displacement-based finite difference time domain (DBFDTD). Three numerical examples are computed with this met...
متن کاملAn Efficient Parallel Determinisation Algorithm for Finite-state Automata
Determinisation of non-deterministic finite automata (NFA) is an important operation not only for optimisation purposes, but also the prerequisite for the complementation operation, which in turn is necessary for creating robust pattern matchers, for example in string replacement and robust parsing. In the paper, we present an efficient parallel determinisation algorithm based on a message-pass...
متن کاملA new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining
Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...
متن کاملOPTIMUM DESIGN OF DOUBLE CURVATURE ARCH DAMS USING A QUICK HYBRID CHARGED SYSTEM SEARCH ALGORITHM
This paper presents an efficient optimization procedure to find the optimal shapes of double curvature arch dams considering fluid–structure interaction subject to earthquake loading. The optimization is carried out using a combination of the magnetic charged system search, big bang-big crunch algorithm and artificial neural network methods. Performing the finite element analysis dur...
متن کامل